Maximal Palindromic Factorization
نویسندگان
چکیده
A palindrome is a symmetric string, phrase, number, or other sequence of units sequence that reads the same forward and backward. We present an algorithm for maximal palindromic factorization of a finite string by adapting an Gusfield algorithm [15] for detecting all occurrences of maximal palindromes in a string in linear time to the length of the given string then using the breadth first search (BFS) to find the maximal palindromic factorization set. A factorization F of s with respect to S refers to a decomposition of s such that s = si1si2 · · · sil where sij ∈ S and l is minimum. In this context the set S is referred to as the factorization set. In this paper, we tackle the following problem. Given a string s, find the maximal palindromic factorization of s, that is a factorization of s where the factorization set is the set of all center-distinct maximal palindromes of a string s MP(s).
منابع مشابه
Triple factorization of non-abelian groups by two maximal subgroups
The triple factorization of a group $G$ has been studied recently showing that $G=ABA$ for some proper subgroups $A$ and $B$ of $G$, the definition of rank-two geometry and rank-two coset geometry which is closely related to the triple factorization was defined and calculated for abelian groups. In this paper we study two infinite classes of non-abelian finite groups $D_{2n}$ and $PSL(2,2^{n})$...
متن کاملFactorization and Palindromic Continued Fractions
Abstract We provide elementary explanations in terms of palindromic continued fraction expansions for the factorization of integers of the form a2 + 1, including Fermat numbers and Cunningham project numbers. This provides a generalization and more complete explanation of the factorization of the sixth Fermat number given by Freeman Dyson at the turn of the century. This explanation may provide...
متن کاملPalindromic Decompositions with Gaps and Errors
Identifying palindromes in sequences has been an interesting line of research in combinatorics on words and also in computational biology, after the discovery of the relation of palindromes in the DNA sequence with the HIV virus. Efficient algorithms for the factorization of sequences into palindromes and maximal palindromes have been devised in recent years. We extend these studies by allowing...
متن کاملGreedy palindromic lengths
In [A. Frid, S. Puzynina, L.Q. Zamboni, On palindromic factorization of words, Adv. in Appl. Math. 50 (2013), 737-748], it was conjectured that any infinite word whose palindromic lengths of factors are bounded is ultimately periodic. We introduce variants of this conjecture and prove this conjecture in particular cases. Especially we introduce left and right greedy palindromic lengths. These l...
متن کاملA subquadratic algorithm for minimum palindromic factorization
We give an O(n logn) time algorithm for factoring a string into the minimum number of palindromic substrings. That is, given a string S[1..n], in O(n logn) time our algorithm returns the minimum number of palindromes S1, . . . , Sl such that S = S1 · · ·Sl.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013